Transparent quantum graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Debates with Small Transparent Quantum Verifiers

We study a model where two opposing provers debate over the membership status of a given string in a language, trying to convince a weak verifier whose coins are visible to all. We show that the incorporation of just two qubits to an otherwise classical constant-space verifier raises the class of debatable languages from at most NP to the collection of all Turing-decidable languages (recursive ...

متن کامل

Transparent boundary conditions for quantum-waveguide simulations

We consider the two-dimensional, time-dependent Schrödinger equation discretized with the Crank-Nicolson finite difference scheme. For this difference equation we derive discrete transparent boundary conditions (DTBCs) in order to get highly accurate solutions for open boundary problems. We apply inhomogeneous DTBCs to the transient simulation of quantum waveguides with a prescribed electron in...

متن کامل

Quantum ergodicity on graphs.

We investigate the equidistribution of the eigenfunctions on quantum graphs in the high-energy limit. Our main result is an estimate of the deviations from equidistribution for large well-connected graphs. We use an exact field-theoretic expression in terms of a variant of the supersymmetric nonlinear sigma model. Our estimate is based on a saddle-point analysis of this expression and leads to ...

متن کامل

Irreversible quantum graphs

Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently strong coupling, the spectrum of the system admits a new continuum mode which exists even if the graph is compact, and a single harmonic oscillator is couple...

متن کامل

Regular quantum graphs

We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way incoming and outgoing channels at vertex scattering processes are connected. Symmetry properties of the quantum graph as well as its spectral statistics depend o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physics Letters A

سال: 2019

ISSN: 0375-9601

DOI: 10.1016/j.physleta.2019.04.059